Convergence and asymptotic agreement in distributed decision problems
نویسندگان
چکیده
منابع مشابه
Mastering Agreement Problems in Distributed Systems
0 7 4 0 7 4 5 9 / 0 1 / $ 1 0 . 0 0 © 2 0 0 1 I E E E crashing. This problem lends itself to further exploration of fundamental mechanisms and concepts such as time-out, multicast, consensus, and failure detector. We will survey recent theoretical results of studies related to agreement problems and show how system engineers can use this information to gain deeper insight into the challenges th...
متن کاملManaged Agreement: Generalizing two fundamental distributed agreement problems
Consensus and Non-Blocking Atomic Commit (NBAC) are two fundamental distributed problems. The specifications of both problems may lead one to think that they are very similar. However, a black-box solution to any of them is not sufficient to solve the other. This paper presents a family of agreement problems called Managed Agreement, which is parameterized by the number of aristocrat nodes in t...
متن کاملMinimizing Information-Centric Convergence Cost in Multi-Agent Agreement Problems
The basic paradigm of learning has shifted significantly, from single agents that learn in single, static environments, to collective learning: multiple, interacting agents with diverse goals learning from each other across different local environments. Instances of collective learning abound in sensor networks, peer-to-peer systems, distributed recommender systems, and in social systems in gen...
متن کاملAsymptotic Convergence Analysis for Distributional Robust Optimization and Equilibrium Problems
In this paper, we study distributional robust optimization approaches for a one stage stochastic minimization problem, where the true distribution of the underlying random variables is unknown but it is possible to construct a set of probability distributions which contains the true distribution and optimal decision is taken on the basis of worst possible distribution from that set. We consider...
متن کاملThe Time-Complexity of Local Decision in Distributed Agreement
Agreement is at the heart of distributed computing. In its simple form, it requires a set of processes to decide on a common value out of the values they propose. The time-complexity of distributed agreement problems is generally measured in terms of the number of communication rounds needed to achieve a global decision; i.e., for all non-faulty (correct) processes to reach a decision. This pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 1984
ISSN: 0018-9286
DOI: 10.1109/tac.1984.1103385